Fully persistent lists with catenation

Simple Confluently Persistent Catenable Lists

We consider the problem of maintaining persistent lists subject to concatenation and to insertions and deletions at both ends. Updates to a persistent data structure are nondestructive{each operation produces a new list incorporating the change while keeping intact the list or lists to which it applies. Although general techniques exist for making data structures persistent, these techniques fa...

Amortization, Lazy Evaluation, and Persistence: Lists with Catenation via Lazy Linking

Amortization has been underutilized in the design of persistent data structures, largely because traditional accounting schemes break down in a persistent setting. Such schemes depend on saving “credits” for future use, but a persistent data structure may have multiple “futures”, each competing for the same credits. We describe how lazy evaluation can often remedy this problem, yielding persist...

Fully persistent B-trees

We present I/O-efficient fully persistent B-Trees that support range searches at any version in O(logB n + t/B) I/Os and updates at any version in O(logB n + log2 B) amortized I/Os, using space O(m/B) disk blocks. By n we denote the number of elements in the accessed version, by m the total number of updates, by t the size of the query’s output, and by B the disk block size. The result improves...

Simple Confluently Persistent Catenable Lists (Extended Abstract)

Properties of Languages with Catenation and Shuffle

We present finite automata for shuffle languages, iteration lemmata for languages with catenation and shuffle, closure properties of such language classes, as well as decidability results.